Causal computational complexity of distributed processes
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Iterative Processes
The theory of optimal algorithmic processes is part of computational complexity. This paper deals with analytic computational complexity. The relation between the goodness of an iteration algorithm and its new function evaluation and memory requirements are analyzed. A new conjecture is stated.
متن کاملRelating distributed, temporal and causal observations of simple processes
The noninterleaving equivalences that have been proposed in the literature may be roughly divided into three classes, depending on the kind of observational scenarios underlying them. Some of them distinguish parallelism from nondeterminism by admitting explicit observations of the causal structure of systems; some others are based on the observation of distribution and still others on the assu...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملEvaluating Complexity – Ethical Challenges in Computational Design Processes
Complexity, as a theoretical background has made it easier to understand and explain the features and dynamic behavior of various complex systems. As the common theoretical background has confirmed, borrowing the terminology for design from the natural sciences has helped to control and understand urban complexity. Phenomena like self-organization, evolution and adaptation are appropriate to de...
متن کاملComputational Complexity and Distributed Execution in Water Quality Management
Modeling is considered an inherent part of design, operation and optimization of Water Quality Systems. Models are used for running so-called Virtual Experiments, such as Simulation and Uncertainty Analysis. Since the complexity of VE’s is constantly increasing, there is a need for techniques that allow for timely execution of complex VE’s on real-world models. This paper touches several of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information & Computation
سال: 2023
ISSN: ['0890-5401', '1090-2651']
DOI: https://doi.org/10.1016/j.ic.2022.104998